#include<vector>

using namespace std;

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int left = 0;
        if (nums[0] > target)
        {
            return 0;
        }
        else if (nums.size() == 1 && nums[0] < target)
        {
            return 1;
        }

        int right = nums.size() - 1;
        while (left < right)
        {
            int mid = left + (right - left + 1) / 2;
            if (nums[mid] > target)
            {
                right = mid - 1;
            }
            else if (nums[mid] < target)
            {
                left = mid;
            }
            else if (nums[mid] == target)
            {
                return mid;
            }
        }
        if (nums[left] == target)
            return left;
        else if (nums[left] > target)
            return left;
        else if (nums[left] < target)
            return left + 1;
        return left + 1;
    }
};

int main()
{
    Solution s;
    vector<int> v{ -1,3,5,6 };
    s.searchInsert(v, 0);
    return 0;
}